Scheduling trains with cross entropy optimisation
نویسندگان
چکیده
منابع مشابه
Optimisation of assembly scheduling in VCIM systems using genetic algorithm
Assembly plays an important role in any production system as it constitutes a significant portion of the lead time and cost of a product. Virtual computer-integrated manufacturing (VCIM) system is a modern production system being conceptually developed to extend the application of traditional computer-integrated manufacturing (CIM) system to global level. Assembly scheduling in VCIM systems is ...
متن کاملEstimating the Entropy Rate of Spike Trains
Information-theoretic methods have been widely used in neuroscience, in the broad effort to analyze and understand the fundamental informationprocessing tasks performed by the brain. In these studies, the entropy has been adopted as the main measure for quantifying the amount of information transmitted between neurons, via the spike trains they generate. One of the first and most important goal...
متن کاملDifferential Entropy of Multivariate Neural Spike Trains
Most approaches to analysing the spatiotemporal dynamics of neural populations involve binning spike trains. This is likely to underestimate the information carried by spike timing codes, in practice, if they involve high precision patterns of inter-spike intervals (ISIs). In this paper we set out to investigate the differential entropy of multivariate neural spike trains, following the work of...
متن کاملEntropy and Information in Neural Spike Trains
The nervous system represents time dependent signals in sequences of discrete, identical action potentials or spikes; information is carried only in the spike arrival times. We show how to quantify this information, in bits, free from any assumptions about which features of the spike train or input signal are most important, and we apply this approach to the analysis of experiments on a motion ...
متن کاملEntropy-based Scheduling Policy for Cross Aggregate Ranking Workloads
Many data exploration applications require the ability to identify the top-k results according to a scoring function. We study a class of top-k ranking problems where top-k candidates in a dataset are scored with the assistance of another set. We call this class of workloads cross aggregate ranking. Example computation problems include evaluating the Hausdorff distance between two datasets, fin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ANZIAM Journal
سال: 2010
ISSN: 1445-8810
DOI: 10.21914/anziamj.v51i0.2594